Enhancing logic synthesis of switching lattices by generalized Shannon decomposition methods

Synthesis of Ternary Quantum Logic Circuits by Decomposition

Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. [1,12] Multivalued quantum systems have also been used in the framework of quantum cryptography, [4] and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. [5] An evolutionary algorithm based synthesizer for ternary quantum ci...

On generalized topological molecular lattices

In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices,  topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...

Boolean Decomposition in Combinational Logic Synthesis

Today’s digital designs have reached a magnitude making it intractable for humans to develop designs on a gate level. Large designs are developed with help of hardware description languages like VHDL, or with other methods using high level of abstraction. Computer based synthesis tools are applied to transfer those descriptions to layouts for implementation in programmable circuits like Field P...

Evolutionary Algorithms in Decomposition-Based Logic Synthesis

BDD Decomposition for Efficient Logic Synthesis

There are two major approaches to the synthesis of logic circuits. One is based on a predominantly algebraic factorization leading to AND/OR logic optimization. The other is based on classical Reed-Muller decompositionmethod and its related decision diagrams, which have been shown to be efficient for XOR-intensive arithmetic functions. Both approaches share the same characteristics: while one i...